Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)
نویسندگان
چکیده
منابع مشابه
Temporally unstructured quantum computation
We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here temporally unstructured (‘instantaneous’) quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using the theory of binary matroids, we argue that the paradigm is rich enough to enable sampling from probability distributions that ...
متن کاملParallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reducibility (sometimes called modular composition) is the automatic ability to break up the design of complex SFE protocols into several simpler, individually secure components. Despite much effort, only the most basic ty...
متن کاملInformation-Theoretically Secure Three-Party Computation with One Active Adversary
A special three-party secure computation problem is studied in which one of three pairwise interacting parties is required to compute a function of the sequences held by the other two when one of the three parties may arbitrarily deviate from the computation protocol (active behavioral model). For this problem, information-theoretic conditions for secure computation are developed within the rea...
متن کاملInformation Theoretically Secure Databases
We introduce the notion of a database system that is information theoretically secure in between accesses—a database system with the properties that 1) users can efficiently access their data, and 2) while a user is not accessing their data, the user’s information is information theoretically secure to malicious agents, provided that certain requirements on the maintenance of the database are r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.266.14